Intersecting Families are Essentially Contained in Juntas
نویسندگان
چکیده
منابع مشابه
Intersecting Families are Essentially Contained in Juntas
A family J of subsets of {1, . . . , n} is called a j-junta if there exists J ⊆ {1, . . . , n}, with |J | = j, such that the membership of a set S in J depends only on S ∩ J . In this paper we provide a simple description of intersecting families of sets. Let n and k be positive integers with k < n/2, and let A be a family of pairwise intersecting subsets of {1, . . . , n}, all of size k. We sh...
متن کاملIndependent Sets in Graph Powers are Almost Contained in Juntas
Let G = (V,E) be a simple undirected graph. Define G, the n-th power of G, as the graph on the vertex set V n in which two vertices (u1, . . . , un) and (v1, . . . , vn) are adjacent if and only if ui is adjacent to vi in G for every i. We give a characterization of all independent sets in such graphs whenever G is connected and non-bipartite. Consider the stationary measure of the simple rando...
متن کاملProbably Intersecting Families are Not Nested
It is well known that an intersecting family of subsets of an nelement set can contain at most 2n−1 sets. It is natural to wonder how ‘close’ to intersecting a family of size greater than 2n−1 can be. Katona, Katona and Katona introduced the idea of a ‘most probably intersecting family.’ Suppose that A is a family and that 0 < p < 1. Let A(p) be the (random) family formed by selecting each set ...
متن کاملChain Intersecting Families
Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if it does not contain chains A1 ( A2 ( · · · ( Ap and B1 ( B2 ( · · · ( Bq with Ap∩Bq = ∅. The maximum size of these families is determined in this paper. Similarly to the p = q = 1 special case (intersecting families) this depends on the notion of r-complementing-chain-pair-free families, where r = p + q − ...
متن کاملIntersecting families of discrete structures are typically trivial
The study of intersecting structures is central to extremal combinatorics. A family of permutations F ⊂ Sn is t-intersecting if any two permutations in F agree on some t indices, and is trivial if all permutations in F agree on the same t indices. A k-uniform hypergraph is tintersecting if any two of its edges have t vertices in common, and trivial if all its edges share the same t vertices. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548308009309